Reduction of stochastic parity to stochastic mean-payoff games
نویسندگان
چکیده
منابع مشابه
Reduction of stochastic parity to stochastic mean-payoff games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with ω-regular winning conditions specified as parity objectives, and mean-payoff (or limit-average) objectives. These games lie in NP ∩ coNP. We present a polynomial-time Turing reduction of stochastic parity games to stochastic mean-payoff games.
متن کاملStochastic Games with Parity Mean-payoff Objective
In this paper, we compute value of two-player games with perfect information equipped with the Par∧Avg>0 objectives. Moreover we show that even though the optimal strategies may require infinite memory, there exists an NP algorithm that computes the almost-sure region.
متن کاملPerfect-Information Stochastic Mean-Payoff Parity Games
The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2 2 -player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other transitions are determined probabilistically. We consider 212 -player games where the objective of the Sys...
متن کاملSimple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems1
We show that a Simple Stochastic Game (SSG) can be formulated as an LP-type problem. Using this formulation, and the known algorithm of Sharir and Welzl [SW] for LP-type problems, we obtain the first strongly subexponential solution for SSGs (a strongly subexponential algorithm has only been known for binary SSGs [L]). Using known reductions between various games, we achieve the first strongly ...
متن کاملStrategy recovery for stochastic mean payoff games
We prove that to find optimal positional strategies for stochastic mean payoff games when the value of every state of the game is known, in general, is as hard as solving such games tout court. This answers a question posed by Daniel Andersson and Peter Bro Miltersen. In this note, we consider perfect information 0-sum stochastic games, which, for short, we will just call stochastic games. For ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2008
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2007.08.035